Veriication of Temporal Properties of Processes in a Setting with Data
نویسندگان
چکیده
We deene a value-based modal-calculus, built from rst-order formulas, modalities, and xed point operators parameterized by data variables, which allows to express temporal properties involving data. We interpret this logic over Crl terms deened by linear process equations. The satisfaction of a temporal formula by a Crl term is translated to the satisfaction of a rst-order formula containing parame-terized xed point operators. We provide proof rules for these xed point operators and show their applicability on various examples.
منابع مشابه
Constrained Properties, Semilinear Systems, and Petri Nets
We investigate the veriication problem of two classes of innnite state systems w.r.t. nonregular properties (i.e., nondeenable by nite-state !-automata). The systems we consider are Petri nets as well as semilinear systems including push-down systems and PA processes. On the other hand, we consider properties ex-pressible in the logic CLTL which is an extension of the linear-time temporal logic...
متن کاملModel Checking and Deduction for Verifying Innnite-state Systems
Two well-known approaches to the veriication of temporal properties of reactive systems are deductive veriication and model checking. In deductive veriication, the validity of temporal properties is reduced to rst-order veriication conditions. In model checking, the validity of the property is established by an exhaustive search of the state space for counterexamples. We review both techniques ...
متن کاملStep: Deductive-algorithmic Veriication of Reactive and Real-time Systems ?
The Stanford Temporal Prover, STeP, combines deductive methods with algorithmic techniques to verify linear-time temporal logic speciications of reactive and real-time systems. STeP uses veriication rules, veriication diagrams, automatically generated invariants, model checking, and a collection of decision procedures to verify nite-and innnite-state systems. computer-aided formal veriication o...
متن کاملSTeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems
The Stanford Temporal Prover, STeP, combines deductive methods with algorithmic techniques to verify linear-time temporal logic speciications of reactive and real-time systems. STeP uses veriication rules, veriication diagrams, automatically generated invariants, model checking, and a collection of decision procedures to verify nite-and innnite-state systems. computer-aided formal veriication o...
متن کاملOn the Veriication of Open Distributed Systems 1
A logic and proof system is introduced for specifying and proving properties of open distributed systems. Key problems that are addressed include the veriication of process networks with a changing interconnection structure, and where new processes can be continuously spawned. To demonstrate the results in a realistic setting we consider a core fragment of the Erlang programming language. Rough...
متن کامل